The authors discussed the procedure of building a sequential coded quardtree , explain how to add points clouds to nodes of tree 阐述了顺序四叉树的快速建立,并通过一个试验系统验证了文中所提方法的有效性。
In order to fast culling invisible data and make result of progressive rendering reasonable , a sequential coded quardtree is built with points clouds evenly distributed to nodes of every layer from top to down 该方法通过构建一棵顺序四叉树使点云均匀分布在四叉树节点上,来实现快速的数据筛选。